Graph Contraction for Mapping Data on Parallel Computers: A Quality–Cost Tradeoff
نویسندگان
چکیده
منابع مشابه
Graph Contraction for Mapping Data on Parallel Computers: A Quality-Cost Tradeoff
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the execution time of the application if the size of the problem is large. In this article, first we motivate the case for graph contraction as a means for reducing the problem size. We restrict our discussion to applicati...
متن کاملGraph Contraction and Connectivity Parallel and Sequential Data
Definition 1.3 (Subgraph). Let G = (V, E) and H = (V ′, E′) be two graphs. H is a subgraph of G if V ′ ⊆ V and E′ ⊆ E. H is a proper subgraph is V ′ ( V or E′ ( E. Definition 1.4 (Vertex Induced Subgraph). Let G = (V, E) and V ′ ⊆ V . The subgraph of G induced by V is a graph H = (V ′, E′) where E′ = {{u, v} ∈ E|u ∈ V ′, v ∈ V ′}. Definition 1.5 (Edge Induced Subgraph). Let G = (V, E) and E′ ⊆ ...
متن کاملA Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be reco...
متن کاملData-parallel programming on MIMD computers
If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and search for the available there. But, it will not happen here. The book that we will offer right here is the soft file concept. This is what make you can easily find and get this data parallel programming on mimd computers by reading this site. We offer you the best product...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 1994
ISSN: 1058-9244,1875-919X
DOI: 10.1155/1994/715918